Search results for "Algebraic curve"

showing 10 items of 25 documents

An Arakelov inequality in characteristic p and upper bound of p-rank zero locus

2008

In this paper we show an Arakelov inequality for semi-stable families of algebraic curves of genus $g\geq 1$ over characteristic $p$ with nontrivial Kodaira-Spencer maps. We apply this inequality to obtain an upper bound of the number of algebraic curves of $p-$rank zero in a semi-stable family over characteristic $p$ with nontrivial Kodaira-Spencer map in terms of the genus of a general closed fiber, the genus of the base curve and the number of singular fibres. An extension of the above results to smooth families of Abelian varieties over $k$ with $W_2$-lifting assumption is also included.

Abelian varietyAlgebra and Number TheoryStable curveCombinatoricsAlgebraic cycleMathematics - Algebraic GeometryMathematics::Algebraic Geometry14D05 (Primary) 14G25 14H10 (Secondary)Algebraic surfaceFOS: MathematicsGenus fieldAlgebraic curveAbelian groupAlgebraic Geometry (math.AG)Singular point of an algebraic varietyMathematicsJournal of Number Theory
researchProduct

Tangential Hilbert problem for perturbations of hyperelliptic Hamiltonian systems

1999

The tangential Hilbert 16th problem is to place an upper bound for the number of isolated ovals of algebraic level curves { H ( x , y ) = const } \{H(x,y)=\operatorname {const}\} over which the integral of a polynomial 1-form P ( x , y ) d x + Q ( x , y ) d y P(x,y)\,dx+Q(x,y)\,dy (the Abelian integral) may vanish, the answer to be given in terms of the degrees n = deg ⁡ H n=\deg H and d = max ( deg ⁡ P , deg ⁡ Q ) d=\max (\deg P,\deg Q) . We describe an algorithm producing this upper bound in the form of a primitive recursive (in fact, elementary) function of n n and d d for the particular case of hyperelliptic polynomials H ( x , y ) = y 2 + U ( x ) H(x,y)=y^2+U(x) under the additional as…

CombinatoricsAbelian integralPolynomialGeneral MathematicsLimit cycleSuperintegrable Hamiltonian systemAlgebraic curveAbelian groupAlgebraic numberMathematicsHamiltonian systemElectronic Research Announcements of the American Mathematical Society
researchProduct

Computation of the topological type of a real Riemann surface

2012

We present an algorithm for the computation of the topological type of a real compact Riemann surface associated to an algebraic curve, i.e., its genus and the properties of the set of fixed points of the anti-holomorphic involution $\tau$, namely, the number of its connected components, and whether this set divides the surface into one or two connected components. This is achieved by transforming an arbitrary canonical homology basis to a homology basis where the $\mathcal{A}$-cycles are invariant under the anti-holomorphic involution $\tau$.

Computational Geometry (cs.CG)FOS: Computer and information sciencesreal Riemann surface[MATH.MATH-AG] Mathematics [math]/Algebraic Geometry [math.AG]homology basis[ MATH.MATH-AG ] Mathematics [math]/Algebraic Geometry [math.AG]Mathematics - Algebraic Geometryreal algebraic curveholomorphic differentialsFOS: MathematicsComputer Science - Computational Geometryreal ovals[MATH.MATH-AG]Mathematics [math]/Algebraic Geometry [math.AG]Algebraic Geometry (math.AG)
researchProduct

Exact, efficient, and complete arrangement computation for cubic curves

2006

AbstractThe Bentley–Ottmann sweep-line method can compute the arrangement of planar curves, provided a number of geometric primitives operating on the curves are available. We discuss the reduction of the primitives to the analysis of curves and curve pairs, and describe efficient realizations of these analyses for planar algebraic curves of degree three or less. We obtain a complete, exact, and efficient algorithm for computing arrangements of cubic curves. Special cases of cubic curves are conics as well as implicitized cubic splines and Bézier curves.The algorithm is complete in that it handles all possible degeneracies such as tangential intersections and singularities. It is exact in t…

Discrete mathematicsArrangementsControl and OptimizationComputationAlgebraic curvesMathematical analysisBézier curveSweep line algorithmComputer Science ApplicationsModuli of algebraic curvesComputational MathematicsGeometric designComputational Theory and MathematicsFamily of curvesSweep-line algorithmExact geometric computationGeometric primitiveAlgebraic curveGeometry and TopologyRobustnessComputingMethodologies_COMPUTERGRAPHICSMathematicsComputational Geometry
researchProduct

Efficient computation of the branching structure of an algebraic curve

2012

An efficient algorithm for computing the branching structure of a compact Riemann surface defined via an algebraic curve is presented. Generators of the fundamental group of the base of the ramified covering punctured at the discriminant points of the curve are constructed via a minimal spanning tree of the discriminant points. This leads to paths of minimal length between the points, which is important for a later stage where these paths are used as integration contours to compute periods of the surface. The branching structure of the surface is obtained by analytically continuing the roots of the equation defining the algebraic curve along the constructed generators of the fundamental gro…

Discrete mathematicsCircular algebraic curveComputational Geometry (cs.CG)FOS: Computer and information sciencesStable curveApplied MathematicsButterfly curve (algebraic)010102 general mathematics010103 numerical & computational mathematics01 natural sciencesModular curveMathematics - Algebraic GeometryComputational Theory and Mathematics14Q05Algebraic surfaceFOS: MathematicsComputer Science - Computational GeometryAlgebraic functionAlgebraic curve0101 mathematicsHyperelliptic curveAlgebraic Geometry (math.AG)AnalysisMathematics
researchProduct

An exact, complete and efficient implementation for computing planar maps of quadric intersection curves

2005

We present the first exact, complete and efficient implementation that computes for a given set P=p1,...,pn of quadric surfaces the planar map induced by all intersection curves p1∩ pi, 2 ≤ i ≤ n, running on the surface of p1. The vertices in this graph are the singular and x-extreme points of the curves as well as all intersection points of pairs of curves. Two vertices are connected by an edge if the underlying points are connected by a branch of one of the curves. Our work is based on and extends ideas developed in [20] and [9].Our implementation is complete in the sense that it can handle all kind of inputs including all degenerate ones where intersection curves have singularities or pa…

Discrete mathematicsCombinatoricssymbols.namesakeGeometric designQuadricDegenerate energy levelsAlgebraic surfaceFamily of curvessymbolsGravitational singularityAlgebraic curveMathematicsPlanar graphProceedings of the twenty-first annual symposium on Computational geometry
researchProduct

Derived categories of irreducible projective curves of arithmetic genus one

2006

We investigate the bounded derived category of coherent sheaves on irreducible singular projective curves of arithmetic genus one. A description of the group of exact auto-equivalences and the set of all $t$ -structures of this category is given. We describe the moduli space of stability conditions, obtain a complete classification of all spherical objects in this category and show that the group of exact auto-equivalences acts transitively on them. Harder–Narasimhan filtrations in the sense of Bridgeland are used as our main technical tool.

Discrete mathematicsDerived categoryPure mathematicsAlgebra and Number TheoryFourier–Mukai transformGroup (mathematics)Moduli spaceCoherent sheafMathematics::Algebraic GeometryMathematics::Category TheoryBounded functionArithmetic genusAlgebraic curveMathematicsCompositio Mathematica
researchProduct

Complete, exact, and efficient computations with cubic curves

2004

The Bentley-Ottmann sweep-line method can be used to compute thearrangement of planar curves provided a number of geometricprimitives operating on the curves are available. We discuss themathematics of the primitives for planar algebraic curves of degreethree or less and derive efficient realizations. As a result, weobtain a complete, exact, and efficient algorithm for computingarrangements of cubic curves. Conics and cubic splines are specialcases of cubic curves. The algorithm is complete in that it handles all possibledegeneracies including singularities. It is exact in that itprovides the mathematically correct result. It is efficient in thatit can handle hundreds of curves with a quart…

Discrete mathematicsModuli of algebraic curvesGeometric designConic sectionComputationFamily of curvesApplied mathematicsGravitational singularityAlgebraic curveSweep line algorithmMathematicsProceedings of the twentieth annual symposium on Computational geometry
researchProduct

An exact and efficient approach for computing a cell in an arrangement of quadrics

2006

AbstractWe present an approach for the exact and efficient computation of a cell in an arrangement of quadric surfaces. All calculations are based on exact rational algebraic methods and provide the correct mathematical results in all, even degenerate, cases. By projection, the spatial problem is reduced to the one of computing planar arrangements of algebraic curves. We succeed in locating all event points in these arrangements, including tangential intersections and singular points. By introducing an additional curve, which we call the Jacobi curve, we are able to find non-singular tangential intersections. We show that the coordinates of the singular points in our special projected plana…

Discrete mathematicsPure mathematicsArrangementsControl and OptimizationFunction field of an algebraic varietyAlgebraic curvesMathematicsofComputing_NUMERICALANALYSISComputational geometryComputer Science ApplicationsComputational MathematicsComputational Theory and MathematicsJacobian curveAlgebraic surfaceComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATIONReal algebraic geometryAlgebraic surfacesExact algebraic computationAlgebraic functionGeometry and TopologyAlgebraic curveAlgebraic numberRobustnessMathematicsSingular point of an algebraic varietyComputational Geometry
researchProduct

An algebraic loop theorem and the decomposition of PD 3 -pairs

2006

Discrete mathematicsPure mathematicsGeneral MathematicsAlgebraic loopDecomposition (computer science)Projective spaceProjective planeAlgebraic curveBézout's theoremMathematicsCylindrical algebraic decompositionBulletin of the London Mathematical Society
researchProduct